A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
نویسندگان
چکیده
We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.
منابع مشابه
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets1
We present an eecient algorithm to compute an optimal rectilinear Steiner tree for extremal point sets. A point set is extremal if every point in it lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used to construct minimum-length connection for multi-terminal nets in homotopic routing in VLSI layout design. The previous best algorithms run in O(k 4 n) ti...
متن کاملComputing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation
The rectilinear Steiner tree problem is to nd a minimum-length rectilinear interconnection of a set of points in the plane. A reduction from the rectilinear Steiner tree problem to the graph Steiner tree problem allows the use of exact algorithms for the graph Steiner tree problem to solve the rectilinear problem. Furthermore, a number of more direct, geometric algorithms have been devised for ...
متن کاملOptimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time
This paper presents an algorithm that computes an optimal rectilinear Steiner minimal tree of n points in at most O(n 2 2:62 n) time. For instances small enough to solve in practice, this time bound is provably faster than any previous algorithm, and improves the previous best bound for practically solvable instances, which is O(n3 n). Experimental evidence is also presented that demonstrates t...
متن کاملTwo-level rectilinear Steiner trees
Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...
متن کاملThumbnail Rectilinear Steiner Trees - VLSI, 1995. Proceedings., Fifth Great Lakes Symposium on
The rectilinear Steiner tree problem i s t o find a manimum-length set of horizontal and vertical line segments that interconnect a given set of points in $he plane. Here we study the thumbnail rectilinear S te iner tree problem, where the inpvt points are drawn f r o m a small integer grid. Specifically, we devise a full-set decomposition algorithm for computing opt ima l thumbnail rectalinear...
متن کامل